N ov 2 00 8 EXTENDING THE COINVARIANT THEOREMS OF CHEVALLEY , SHEPHARD – TODD , MITCHELL , AND SPRINGER

نویسنده

  • PETER WEBB
چکیده

We extend in several directions invariant theory results of Chevalley, Shephard and Todd, Mitchell and Springer. Their results compare the group algebra for a finite reflection group with its coinvariant algebra, and compare a group representation with its module of relative coinvariants. Our extensions apply to arbitrary finite groups in any characteristic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

m at h . A C ] 2 4 M ay 2 00 8 EXTENDING THE COINVARIANT THEOREMS OF CHEVALLEY , SHEPHARD – TODD , MITCHELL , AND SPRINGER

We extend in several directions invariant theory results of Chevalley, Shephard and Todd, Mitchell and Springer. Their results compare the group algebra for a finite reflection group with its coinvariant algebra, and compare a group representation with its module of relative coinvariants. Our extensions apply to arbitrary finite groups in any characteristic.

متن کامل

Phonemic Representations and Categories

Y.E. Cohen et al. (eds.), Neural Correlates of Auditory Cognition, Springer Handbook of Auditory Research 45, DOI 10.1007/978-1-4614-2350-8_6, © Springer Science+Business Media New York 2013

متن کامل

Oestrogen receptor activation in the absence of ligand.

34 Dickson, R. B. and Lippman, M. E. (1987) Endocr. Rev. 8, 29-43 35 McLachlan, J. A., Nelson, K. G., Takahashi, S., Bossert, N. L., Newbold, R. R. and Korach, K. S. (1991) in Growth Factors in Reproduction (Schomberg, D. W., ed.), pp. 197-203, Springer, New York 36 Mukku, V. R. and Stancel, G. M. (1985) J. Biol. Chem. 260,9820-9824 37 DiAugustine, R. P., Petruez, P., Bell, G. I. et al. (1988) ...

متن کامل

Local Bisection Refinement for N-Simplicial Grids Generated by Reflection

A simple local bisection refinement algorithm for the adaptive refinement of n-simplicial grids is presented. The algorithm requires that the vertices of each simplex be ordered in a special way relative to those in neighboring simplices. It is proven that certain regular simplicial grids on [0, 1]n have this property, and the more general grids to which this method is applicable are discussed....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008